A fast exact quantum algorithm for solitude verification
نویسندگان
چکیده
منابع مشابه
A fast exact quantum algorithm for solitude verification
Solitude verification is arguably one of the simplest fundamental problems in distributed computing, where the goal is to verify that there is a unique contender in a network. This paper devises a quantum algorithm that exactly solves the problem on an anonymous network, which is known as a network model with minimal assumptions [Angluin, STOC’80]. The algorithm runs in O(N) rounds if every par...
متن کاملExact Quantum Query Algorithm for Error Detection Code Verification
Quantum algorithms can be analyzed in a query model to compute Boolean functions. Function input is provided in a black box, and the aim is to compute the function value using as few queries to the black box as possible. A repetition code is an error detection scheme that repeats each bit of the original message r times. After a message with redundant bits is transmitted via a communication cha...
متن کاملA block exact fast affine projection algorithm
This paper describes a block (affine) projection algorithm that has exactly the same convergence rate as the original sample-by-sample algorithm and smaller computational complexity than the fast affine projection algorithm. This is achieved by 1) introducing a correction term that compensates for the filter output difference between the sample-by-sample projection algorithm and the straightfor...
متن کاملIDA*_MCSP: a fast exact MCSP algorithm
QoS routing has been shown to be NP-hard. A recent study of its hardness suggests that the “worst-case” may not occur in practice and thus there may exist a fast exact algorithm. In this paper, we deploy the idea of iterative deepening search and look ahead to design an exact algorithm for finding the shortest path subject to multiple constraints (the MCSP problem). The accuracy of look-ahead i...
متن کاملQuantum Algorithm Processor For Finding Exact Divisors
Introduction The goal is to find factors of a given number N with n bits as required for various purposes. This may be done in a quantum algorithm processor fabricated in CMOS as originally promoted by the author [1]. Each register may execute in parallel the instructions in a wiring diagram to accomplish division by integers from 2 to √N. This amounts to dividing by all n/2 bit divisors (for n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2017
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic17.1-2-2